Hierarchical Representation of Discrete Data on Graphs

We propose a new hierarchical representation of discrete data sets living on graphs. The approach takes advantage of recent works on graph regularization. The role of the merging criterion that is common to hierarchical representations is greatly reduced due to the regularization step. The regularization is performed recursively with a decreasing fidelity parameter. This yields a robust representation of data sets. We show experiments on digital images and image databases.